The Forbidden Projections of Unate Functions
نویسندگان
چکیده
We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph minors. Unate functions have been studied in switching theory and in computational learning theory.
منابع مشابه
Generation of Representative Functions of the NPN Equivalence Classes of Unate Boolean Functions
An algorithm is described which generates the set of representative functions of the negation and/or permutation of variables and negation of the function (NPN) equivalence classes of unate Boolean functions. The algorithm is based upon integer programming techniques. The set of representative functions for the NPN equivalence classes of unate functions of six or fewer variables was obtained us...
متن کاملNested Canalyzing, Unate Cascade, and Polynomial Functions.
This paper focuses on the study of certain classes of Boolean functions that have appeared in several different contexts. Nested canalyzing functions have been studied recently in the context of Boolean network models of gene regulatory networks. In the same context, polynomial functions over finite fields have been used to develop network inference methods for gene regulatory networks. Finally...
متن کاملCubical CAMP for Minimization of Boolean Functions - VLSI Design, 1996. Proceedings., Ninth International Conference on
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set of the function. Two significant contributions of QCAMP are the UNATE-TEST which tests if a given function is a unaie function, .and the BISECT procedure which minimizes a cyclic function without taking recourse t o b...
متن کاملProperties of Boolean networks and methods for their tests
: Transcriptional regulation networks are often modeled as Boolean networks. We discuss certain properties of Boolean functions (BFs), which are considered as important in such networks, namely, membership to the classes of unate or canalizing functions. Of further interest is the average sensitivity (AS) of functions. In this article, we discuss several algorithms to test the properties of int...
متن کاملDecision Trees: More Theoretical Justification
We study impurity-based decision tree algorithms such as CART, C4.5, etc., so as to better understand their theoretical underpinnings. We consider such algorithms on special forms of functions and distributions. We deal with the uniform distribution and functions that can be described as unate functions, linear threshold functions and readonce DNF. For unate functions we show that that maximal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 77 شماره
صفحات -
تاریخ انتشار 1997